Improved Algorithm for Importance Density Sample in Particle Filter ?

نویسندگان

  • Haitao JIA
  • Mei XIE
  • Xixu HE
چکیده

Particle filtering is a technique used for filtering non-linear and non-Gaussian dynamical systems. It has found widespread applications in detection, navigation, and tracking problems. Although, in general, particle filtering methods yield improved results, it is difficult to achieve real time performance. This paper presents an improved algorithm to get better convergence. This algorithm uses the Kalman filter to construct importance density function of the particle filter for state prediction. This improved algorithm fully considers the problem that there is limited priori information at the beginning of filter in maneuvering target tracking. It is shown that this algorithm could gain better tracking results through simulation results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Research on Particle Filter Algorithm Based on Neural Network

Aiming at the weight degeneracy phenomena in particle filter algorithm, the improved particle filtering algorithm based on neural network was presented. BP neural network and generalized regression neural network (GRNN) are adapted to improve resampling algorithm and importance probability density function. This algorithm utilizes the nonlinear mapping function of BP neural network. First of al...

متن کامل

An Improved Particle Filter Algorithm Based on Neural Network for Target Tracking

To the shortcoming of general particle filter, an improved algorithm based on neural network is proposed and is shown to be more efficient than the general algorithm in the same sample size. The improved algorithm has mainly optimized the choice of importance density. After receiving the samples drawn from prior density, and then adjust the samples with general regression neural network (GRNN),...

متن کامل

Unscented Auxiliary Particle Filter Implementation of the Cardinalized Probability Hypothesis Density Filters

The probability hypothesis density (PHD) filter suffers from lack of precise estimation of the expected number of targets. The Cardinalized PHD (CPHD) recursion, as a generalization of the PHD recursion, remedies this flaw and simultaneously propagates the intensity function and the posterior cardinality distribution. While there are a few new approaches to enhance the Sequential Monte Carlo (S...

متن کامل

An Efficient Target Tracking Algorithm Based on Particle Filter and Genetic Algorithm

In this paper, we propose an efficient hybrid Particle Filter (PF) algorithm for video tracking by employing a genetic algorithm to solve the sample impoverishment problem. In the presented method, the object to be tracked is selected by a rectangular window inside which a few numbers of particles are scattered. The particles’ weights are calculated based on the similarity between feature vecto...

متن کامل

Particle Filter Improved by Genetic Algorithm and Particle Swarm Optimization Algorithm

Particle filter algorithm is a filtering method which uses Monte Carlo idea within the framework of Bayesian estimation theory. It approximates the probability distribution by using particles and discrete random measure which is consisted of their weights, it updates new discrete random measure recursively according to the algorithm. When the sample is large enough, the discrete random measure ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013